The directed Chinese Postman Problem
نویسنده
چکیده
The Chinese Postman Problem has many applications, including robot exploration, and analysing interactive system and web site usability. This paper reviews the wide range of applications of the problem and presents complete, executable code to solve it for the case of directed multigraphs. A variation called the ‘open Chinese Postman Problem’ is also introduced and solved. Although optimisations are possible, no substantially better algorithms are likely.
منابع مشابه
Chinese Postman Problem on Edge-Colored Multigraphs
It is well-known that the Chinese Postman Problem on undirected and directed graphs is polynomial-time solvable. We extend this result to edge-colored multigraphs. Our result is in sharp contrast to the Chinese Postman Problem on mixed graphs, i.e., graphs with directed and undirected edges, for which the problem is NP-hard.
متن کاملOn the mixed Chinese postman problem
The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation polyhedron are all half-integral. keywords: Chinese postman problem, half-integrality, graph, flow
متن کاملThe maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem
This paper introduces the maximum benefit Chinese postman problem (MBCPP) and the maximum benefit traveling salesman problem (MBTSP). For the MBCPP a benefit is realized each time a link of a directed graph is traversed. The MBCPP relaxes the constraint of the Chinese postman problem that each link be traversed at least once and finds a tour of maximum total net benefit. For the MBTSP a benefit...
متن کاملOAR Lib: An Open Source Arc Routing Library
We provide a flexible graph architecture, and an implementation of solvers to some of the most ubiquitous problems in the field of Arc Routing, (The Chinese Postman Problem on undirected, directed, mixed, and windy graphs, as well as the Rural Postman Problem on directed and windy graphs). The project is completed in java, is open source, and is hosted at https://github.com/Olibear/ArcRoutingLi...
متن کاملEfficient Algorithms for Eulerian Extension and Rural Postman
The aim of directed Eulerian extension problems is to make a given directed, possibly arc-weighted, (multi-)graph Eulerian by adding a minimum-cost set of arcs. These problems have natural applications in scheduling and arc routing and are closely related to the Chinese Postman and Rural Postman problems. Our main result is to show that the NP-hard WeightedMultigraph Eulerian Extension problem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Softw., Pract. Exper.
دوره 33 شماره
صفحات -
تاریخ انتشار 2003